Approximate multi-matroid intersection via iterative refinement
نویسندگان
چکیده
منابع مشابه
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
In the buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to some constraints on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost that is a fixed fraction of the bid value. Previous to our work, deterministic and randomized algorithms ...
متن کاملMatroid Intersection
Last lecture we covered matroid intersection, and defined matroid union. In this lecture we review the definitions of matroid intersection, and then show that the matroid intersection polytope is TDI. This is Chapter 41 in Schrijver’s book. Next we review matroid union, and show that unlike matroid intersection, the union of two matroids is again a matroid. This material is largely contained in...
متن کاملInformation filtering via Iterative Refinement
– With the explosive growth of accessible information, expecially on the Internet, evaluation-based filtering has become a crucial task. Various systems have been devised aiming to sort through large volumes of information and select what is likely to be more relevant. In this letter we analyse a new ranking method, where the reputation of information providers is determined self-consistently. ...
متن کاملPersistency and matroid intersection
In this paper, we show that for any independence system, the problem of finding a persistency partition of the ground set and that of finding a maximum weight independent set are polynomially equivalent.
متن کاملBudgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we consider two such problems, namely maximum-weight matching and maximumweight matroid intersection with one additional budget constraint. We present the first polynomial-time approximation schemes for these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01524-y